Injecting uniformities into Peano arithmetic
نویسنده
چکیده
We present a functional interpretation of Peano arithmetic that uses Gödel’s computable functionals and which systematically injects uniformities into the statements of finite-type arithmetic. As a consequence, some uniform boundedness principles (not necessarily set-theoretically true) are interpreted while maintaining unmoved the Π2-sentences of arithmetic. We explain why this interpretation is taylored to yield conservation results.
منابع مشابه
Non-Commutative Infinitary Peano Arithmetic
Does there exist any sequent calculus such that it is a subclassical logic and it becomes classical logic when the exchange rules are added? The first contribution of this paper is answering this question for infinitary Peano arithmetic. This paper defines infinitary Peano arithmetic with non-commutative sequents, called non-commutative infinitary Peano arithmetic, so that the system becomes eq...
متن کاملEliminating Skolem Functions in Peano Arithmetic with Interactive Realizability
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result – which shows that the Excluded Middle principle can be used to eliminate Skolem functions – has been previously proved by other techniques, among them the epsilon substitution method and forcing. In our proof, we employ Inter...
متن کاملInteractive Realizability and the elimination of Skolem functions in Peano Arithmetic
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result – which shows that the Excluded Middle principle can be used to eliminate Skolem functions – has been previously proved by other techniques, among them the epsilon substitution method and forcing. In our proof, we employ Inter...
متن کاملOrder types of models of reducts of Peano Arithmetic and their fragments
It is well-known that non-standard models of Peano Arithmetic have order type N+Z ·D where D is a dense linear order without first or last element. Not every order of the form N+Z ·D is the order type of a model of Peano Arithmetic, though; in general, it is not known how to characterise those D for which this is the case. In this paper, we consider syntactic fragments of Peano Arithmetic (both...
متن کاملRealizability for Peano Arithmetic with Winning Conditions in HON Games
We build a realizability model for Peano arithmetic based on winning conditions for HON games. First we define a notion of winning strategies on arenas equipped with winning conditions. We prove that the interpretation of a classical proof of a formula is a winning strategy on the arena with winning condition corresponding to the formula. Finally we apply this to Peano arithmetic with relativiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 157 شماره
صفحات -
تاریخ انتشار 2009